(0) Obligation:
Runtime Complexity TRS:
The TRS R consists of the following rules:
a(a(x1)) → b(b(b(x1)))
b(b(x1)) → c(c(c(x1)))
c(c(x1)) → d(d(d(x1)))
b(x1) → d(d(x1))
c(d(d(x1))) → a(x1)
Rewrite Strategy: INNERMOST
(1) CpxTrsToCdtProof (BOTH BOUNDS(ID, ID) transformation)
Converted CpxTRS to CDT
(2) Obligation:
Complexity Dependency Tuples Problem
Rules:
a(a(z0)) → b(b(b(z0)))
b(b(z0)) → c(c(c(z0)))
b(z0) → d(d(z0))
c(c(z0)) → d(d(d(z0)))
c(d(d(z0))) → a(z0)
Tuples:
A(a(z0)) → c1(B(b(b(z0))), B(b(z0)), B(z0))
B(b(z0)) → c2(C(c(c(z0))), C(c(z0)), C(z0))
C(d(d(z0))) → c5(A(z0))
S tuples:
A(a(z0)) → c1(B(b(b(z0))), B(b(z0)), B(z0))
B(b(z0)) → c2(C(c(c(z0))), C(c(z0)), C(z0))
C(d(d(z0))) → c5(A(z0))
K tuples:none
Defined Rule Symbols:
a, b, c
Defined Pair Symbols:
A, B, C
Compound Symbols:
c1, c2, c5
(3) CdtUnreachableProof (EQUIVALENT transformation)
The following tuples could be removed as they are not reachable from basic start terms:
B(b(z0)) → c2(C(c(c(z0))), C(c(z0)), C(z0))
(4) Obligation:
Complexity Dependency Tuples Problem
Rules:
a(a(z0)) → b(b(b(z0)))
b(b(z0)) → c(c(c(z0)))
b(z0) → d(d(z0))
c(c(z0)) → d(d(d(z0)))
c(d(d(z0))) → a(z0)
Tuples:
C(d(d(z0))) → c5(A(z0))
A(a(z0)) → c1(B(b(b(z0))), B(b(z0)), B(z0))
S tuples:
A(a(z0)) → c1(B(b(b(z0))), B(b(z0)), B(z0))
C(d(d(z0))) → c5(A(z0))
K tuples:none
Defined Rule Symbols:
a, b, c
Defined Pair Symbols:
C, A
Compound Symbols:
c5, c1
(5) CdtGraphRemoveDanglingProof (ComplexityIfPolyImplication transformation)
Removed 2 of 2 dangling nodes:
A(a(z0)) → c1(B(b(b(z0))), B(b(z0)), B(z0))
C(d(d(z0))) → c5(A(z0))
(6) Obligation:
Complexity Dependency Tuples Problem
Rules:
a(a(z0)) → b(b(b(z0)))
b(b(z0)) → c(c(c(z0)))
b(z0) → d(d(z0))
c(c(z0)) → d(d(d(z0)))
c(d(d(z0))) → a(z0)
Tuples:none
S tuples:none
K tuples:none
Defined Rule Symbols:
a, b, c
Defined Pair Symbols:none
Compound Symbols:none
(7) SIsEmptyProof (EQUIVALENT transformation)
The set S is empty
(8) BOUNDS(O(1), O(1))